A Predictive Algorithm for Adaptive Resource Management of Periodic Tasks in Asynchronous Real-Time Distributed Systems

نویسندگان

  • Binoy Ravindran
  • Tamir Hegazy
چکیده

Real-time distributed applications such as those that are emerging for managing the entire mission of a system are characterized by significant execution-time uncertainties in the application environment and system resource state. Thus, such systems require adaptive resource management that dynamically monitor the system for adherence to the desired real-time requirements and perform run-time adaptation of the application to changing workloads when unacceptable timeliness behavior is observed. In this paper, we present a “predictive” resource management algorithm that forecasts the timeliness behavior of periodic tasks during the resource allocation process and select allocations that yield the optimal forecasted timeliness. The algorithm uses statistical regression theory-based techniques for predicting task timeliness. The algorithm uses regression equations that are based on external load parameters such as number of sensor reports and internal resource load parameters such as CPU utilization. The regression equations are determined from application profile data that is obtained by measuring the timeliness of the application for a set of external and internal load situations. The performance of the predictive algorithm is studied by comparing with a non-predictive resource management algorithm that uses heuristic rules for allocating resources. The experimental results indicate that the predictive algorithm outperforms the non-predictive algorithm when the workload shows fluctuating behavior.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Adaptive Communication in Asynchronous Real-Time Distributed Systems

We present adaptive communication heuristic algorithms for periodic tasks in asynchronous real-time distributed systems. The heuristic algorithms adapt the application to workload changes through trans-node message-level adaptation mechanisms. We present adaptive communication heuristics for IEEE 802.5 token ring networks that support the prioritydriven protocol and for FDDI networks that use t...

متن کامل

Adaptive Resource Management Algorithms for Periodic Tasks in Dynamic Real-Time Distributed Systems

We present adaptive resource management middleware techniques for periodic tasks in dynamic real-time distributed systems. The techniques continuously monitor the application at run-time for adherence to the desired real-time requirements, detect timing failures or trends for impending failures (due to workload fluctuations), and dynamically allocate resources by replicating subtasks of applica...

متن کامل

Preemptive Task Partitioning Strategy (PTPS) with Fast Preemption in Heterogeneous Distributed Environment

Efficient preemptions in the scheduling of real time systems cause optimal overhead in parallel computing systems. Periodic and sporadic tasks are exists in the real time systems. The periodic tasks may be divided into the synchronous and asynchronous categories. The management of the resource sharing in the parallel computing can be powerfully achieved by preemptive scheduling. Fast preemption...

متن کامل

Adaptive Resource Management in Asynchronous Real-Time Distributed Systems Using Feedback Control Functions

In this paper, we present feedback control techniques for performing adaptive resource management in asynchronous real-time distributed systems. Asynchronous real-time distributed systems are characterized by significant execution-time uncertainties in the application environment and system resource state. Thus, such systems require adaptive resource management that dynamically monitor the syst...

متن کامل

Efficient Feasibility Analysis of Real-Time Asynchronous Task Sets

Several schedulability tests for real-time periodic task sets scheduled under the Earliest Deadline First algorithm have been proposed in literature, including analyses for precedence and resource constraints. However, all available tests consider synchronous task sets only, that are task sets in which all tasks are initially activated at the same time. In fact, every necessary and sufficient f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001